Packet Compression Ratio Dependent Spanning Tree for Convergecast
نویسندگان
چکیده
منابع مشابه
Packet Compression Ratio Dependent Spanning Tree for Convergecast
A convergecast is a popular routing in sensor networks. It periodically forwards collected data at every sensor node along a configured routing path to the outside of a sensor network via the base station (BS). To extend the lifetime of energy-limited sensor networks, many previous researches proposed schemes for data compression. However, few researches investigated the relation between packet...
متن کاملSpanning tree based algorithms for low latency and energy efficient data aggregation enhanced convergecast (DAC) in wireless sensor networks
Many wireless sensor networks (WSNs) employ battery-powered sensor nodes. Communication in such networks is very taxing on its scarce energy resources. Convergecast – process of routing data from many sources to a sink – is commonly performed operation in WSNs. Data aggregation is a frequently used energy-conversing technique in WSNs. The rationale is to reduce volume of communicated data by us...
متن کاملAdjustable convergecast tree protocol for wireless sensor networks
Abstract—For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important communication pattern commonly used to collect continuous data. The prior broadcast trees are not suitable for convergecast, because convergecast is a reverse broadcast process. We point out the load-balancing pro...
متن کاملColor Image Compression Based On Wavelet Packet Best Tree
In Image Compression, the researchers’ aim is to reduce the number of bits required to represent an image by removing the spatial and spectral redundancies. Recently discrete wavelet transform and wavelet packet has emerged as popular techniques for image compression. The wavelet transform is one of the major processing components of image compression. The result of the compression changes as p...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Sensor Network
سال: 2010
ISSN: 1945-3078,1945-3086
DOI: 10.4236/wsn.201027062